On a subclass of ∞-regular languages
نویسندگان
چکیده
منابع مشابه
Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملOn fuzzy multiset regular languages
The purpose of present work is to study some algebraic aspect of fuzzy multiset regular languages. In between, we show the equivalence of multiset regular language and fuzzy multiset regular language. Finally, we introduce the concept of pumping lemma for fuzzy multiset regular languages, which we use to establish a necessary and sufficient condition for a fuzzy multiset language to be non-cons...
متن کاملCo-Regular Languages and Uni cation of Co-Regular Languages
The main goal of this work is the investigation of some properties of co-regular languages. In many applications it is important to handle innnite sets of terms. We represent two equivalent formalisms for nite deened innnite sets of term substitutions which are leading to co-regular languages. As it will be proved later the co-regular languages are monoidic homomorphical images of regular langu...
متن کاملA Polynomial Time Learner for a Subclass of Regular Patterns
Presented is an algorithm (for learning a subclass of erasing regular pattern languages) which can be made to run with arbitrarily high probability of success on extended regular languages generated by patterns π of the form x0α1x1...αmxm for unknown m but known c , from number of examples polynomial in m (and exponential in c ), where x0, . . . , xm are variables and where α1, ..., αm are each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1988
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90105-3